The randomized Kaczmarz method with mismatched adjoint
نویسندگان
چکیده
منابع مشابه
The Randomized Kaczmarz Method with Mismatched Adjoint
This paper investigates the randomized version of the Kaczmarz method to solve linear systems in the case where the adjoint of the system matrix is not exact—a situation we refer to as “mismatched adjoint”. We show that the method may still converge both in the overand underdetermined consistent case under appropriate conditions, and we calculate the expected asymptotic rate of linear convergen...
متن کاملComments on the randomized Kaczmarz method
In this short note we respond to some concerns raised by Y. Censor, G. Herman, and M. Jiang about the randomized Kaczmarz method that we proposed in [5]. The Kaczmarz method is a well-known iterative algorithm for solving a linear system of equations Ax = b. For more than seven decades, this method was useful in practical applications, and it was studied in many research papers. Despite of this...
متن کاملRandomized Block Kaczmarz Method with Projection for Solving Least Squares
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...
متن کاملConvergence of the randomized Kaczmarz method for phase retrieval
The classical Kaczmarz iteration and its randomized variants are popular tools for fast inversion of linear overdetermined systems. This method extends naturally to the setting of the phase retrieval problem via substituting at each iteration the phase of any measurement of the available approximate solution for the unknown phase of the measurement of the true solution. Despite the simplicity o...
متن کاملLinear convergence of the Randomized Sparse Kaczmarz Method
The randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the recently proposed Randomized Sparse Kaczmarz method for recovery of sparse solutions, as well as many variants, also converges linearly in expectation. The result is achieved in the framework of split feasibility prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2018
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-018-0717-x